Square Involutions
نویسندگان
چکیده
A square involution is a square permutation which is also an involution. In this paper we give the enumeration of square involutions, using purely combinatorial methods, by establishing a bijective correspondence with a class of lattice paths. As a corollary to our result, we enumerate various subclasses of square involutions, including the classes of triangular, decomposable, and fat involutions.
منابع مشابه
Metabolic Involutions and Quadratic Radical Extensions
In this paper we characterise involutions that become metabolic over a quadratic field extension attained by adjoining a square root.
متن کاملOn Some (Pseudo) Involutions in the Riordan Group
In this paper, we address a question posed by L. Shapiro regarding algebraic and/or combinatorial characterizations of the elements of order 2 in the Riordan group. We present two classes of combinatorial matrices having pseudo-order 2. In one class, we find generalizations of Pascal’s triangle and use some special cases to discover and prove interesting identities. In the other class, we find ...
متن کاملGenus 3 curves with many involutions and application to maximal curves in characteristic 2
Let k = Fq be a finite field of characteristic 2. A genus 3 curve C/k has many involutions if the group of k-automorphisms admits a C2 × C2 subgroup H (not containing the hyperelliptic involution if C is hyperelliptic). Then C is an ArtinSchreier cover of the three elliptic curves obtained as the quotient of C by the nontrivial involutions of H , and the Jacobian of C is k-isogenous to the prod...
متن کاملSymmetrized random permutations
Selecting N random points in a unit square corresponds to selecting a random permutation. Placing symmetry restrictions on the points, we obtain special kinds of permutations : involutions, signed permutations and signed involutions. We are interested in the statistics of the length (in numbers of points) of the longest up/right path in each symmetry type as the number of points increases to in...
متن کاملDecreasing Subsequences in Permutations and Wilf Equivalence for Involutions
In a recent paper, Backelin, West and Xin describe a map φ∗ that recursively replaces all occurrences of the pattern k . . . 21 in a permutation σ by occurrences of the pattern (k − 1) . . . 21k. The resulting permutation φ∗(σ ) contains no decreasing subsequence of length k. We prove that, rather unexpectedly, the map φ∗ commutes with taking the inverse of a permutation. In the BWX paper, the ...
متن کامل